Unitary designs with regular sets of points

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular triangulations of dynamic sets of points

The Delaunay triangulations of a set of points are a class of triangulations which play an important role in a variety of different disciplines of science. Regular triangulations are a generalization of Delaunay triangulations that maintain both their relationship with convex hulls and with Voronoi diagrams. In regular triangulations, a real value, its weight, is assigned to each point. In this...

متن کامل

Fixed Points of Asymptotically Regular Nonexpansive Mappings on Nonconvex Sets

It is shown that if X is a Banach space and C is a union of finitely many nonempty, pairwise disjoint, closed, and connected subsets {Ci : 1≤ i≤ n} of X , and each Ci has the fixed-point property (FPP) for asymptotically regular nonexpansive mappings, then any asymptotically regular nonexpansive self-mapping of C has a fixed point. We also generalize the Goebel-Schöneberg theorem to some Banach...

متن کامل

Unitary t-designs

Unitary t-designs provide a method to simplify integrating polynomials of degree less than t over U(d). We prove a classic result the trace double sum inequality and use it to derive the fundamental symmetries of t-designs. As an alternate approach to deriving an asymptotically tight lower bound on the size of t-designs, we introduce a greedy algorithm for constructing designs. Unfortunately, w...

متن کامل

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code — a subset of U(d) in which...

متن کامل

Implementing Unitary 2-Designs Using Random Diagonal-unitary Matrices

Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diago...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1988

ISSN: 0012-365X

DOI: 10.1016/0012-365x(88)90052-0